#include <iostream>
#include <cstring>
#include <algorithm>
#include <cstdio>
#include <cmath>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <set>
#include <bitset>
#include <utility>
using namespace std;

#define mm(a, n) memset(a, n, sizeof a)
#define mk(a, b) make_pair(a, b)

const double eps = 1e-6;
const int INF = 0x3f3f3f3f;

typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;
typedef pair<int, LL> PIL;

inline void quickread() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
}


int n;

inline void solution() {
    cin >> n;
    map<int, int> mp;
    printf("%d=", n);
    if (n == 1) {
        printf("1\n");
        return ;
    }
    for (int i = 2; i <= n / i; i ++) {
        while (n % i == 0) {
            mp[i] ++ ;
            n /= i;
        }
    }
    // 如果最后剩下1 就不用保存
    if (n != 1) 
        mp[n] ++;

    int idx = 0;
    for (auto & m : mp) {
        if (idx == 0) {
            if (m.second == 1) printf("%d", m.first);
            else printf("%d^%d", m.first, m.second);
        } else {
            if (m.second == 1) printf("*%d", m.first);
            else printf("*%d^%d", m.first, m.second);
        }
        idx ++;
    }
    printf("\n");
}

int main() {
    freopen("input.txt", "r", stdin);
    quickread();
    solution();
    return 0;
}